A Semantic Without Syntax 1

نویسنده

  • Farzad Didehvar
چکیده

Here, by introducing a version of “Unexpected hanging paradox” we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support that. In the end, we propose a claim as a question. Based on this claim, having an axiomatic system for computability theory is not possible. In fact we will show that the method applied here could yields us as a generalized result, some Theories like Physic is not axiomatizable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

متن کامل

Integrating Metadata and Data Syntax Translation

In syntax translation between languages, the advantage of using a single internal language as a translation mediator is a reduction of the total number of translators required. To achieve bi-directional translation between n languages requires n(n − 1) translators without a central mediator, as opposed to 2(n + 1) translators using an internal language. Our goal is to simplify syntax translatio...

متن کامل

Relation between Semantic Completeness and Syntax Completeness on General Formal Systems

Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper analyze the relation between semantic completeness of a formal system S and syntax completeness under certain condition and the relation between the syntax completeness of S and the syntax completeness of consistent ext...

متن کامل

Low-Resource Semantic Role Labeling

We explore the extent to which highresource manual annotations such as treebanks are necessary for the task of semantic role labeling (SRL). We examine how performance changes without syntactic supervision, comparing both joint and pipelined methods to induce latent syntax. This work highlights a new application of unsupervised grammar induction and demonstrates several approaches to SRL in the...

متن کامل

Native-like Event-related Potentials in Processing the Second Language Syntax: Late Bilinguals

Background: The P600 brain wave reflects syntactic processes in response to different first language (L1) syntactic violations, syntactic repair, structural reanalysis, and specific semantic components. Unlike semantic processing, aspects of the second language (L2) syntactic processing differ from the L1, particularly at lower levels of proficiency. At higher L2 proficiency, syntactic violatio...

متن کامل

Interpreters From Functions and Grammars

-The addition of context free grammar rules to a functional language simplifies the construction of interpreters from denotationaI semantic language definitions. Functional abstraction over grammar rules enables the specification and processing of context sensitive language syntax aspects in a functional style. DenotatLonaI semantics Language design Language implementation Functional language G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1203.3125  شماره 

صفحات  -

تاریخ انتشار 2012